On the Span and Extent of Unit-Distance Graphs in the Plane
نویسندگان
چکیده
Let G be a unit-distance graph in R2. For each unit-distance representation of G in R2, there is a smallest circumscribing circle. The infimum of the diameters of these circles, taken over all unit-distance representations of G, is called the span of G. On the other hand, the supremum of the diameters of all such circles is called the extent of G. We show that the ratio of the extent to the diameter can be made arbitrarily small. Also, we prove that the extent of G does not exceed 2 3 √ 3 times the graph theoretic diameter of G. We further show that for every integer d ≥ 1, there exists a unit-distance graph G in R2 with diameter d and extent equal to 23 √ 3d.
منابع مشابه
On Plane Waves for Mode-I Crack Problem in Generalized Thermoelasticity
A general model of the equations of generalized thermoelasticity for an infinite space weakened by a finite linear opening Mode-I crack is solving. The material is homogeneous and has isotropic properties of elastic half space. The crack is subjected to prescribed temperature and stress distribution. The formulation is applied to generalized thermoelasticity theories, the Lord-Şhulman...
متن کاملOn the distance eigenvalues of Cayley graphs
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
متن کاملOn reverse degree distance of unicyclic graphs
The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the...
متن کاملProduct version of reciprocal degree distance of composite graphs
A {it topological index} of a graph is a real number related to the graph; it does not depend on labeling or pictorial representation of a graph. In this paper, we present the upper bounds for the product version of reciprocal degree distance of the tensor product, join and strong product of two graphs in terms of other graph invariants including the Harary index and Zagreb indices.
متن کاملSome results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs
Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...
متن کامل